Tree decomposition - PDFSEARCH.IO - Document Search Engine

Tree decomposition
Results: 411

#	Item
101	C:/Documents and Settings/Arik Motskin/Desktop/CCCG/cds_cccg_paper.dvi Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:14 Network flow Dominating set Graph Flow network Connectivity Topology Tree decomposition Centrality Graph theory Mathematics Theoretical computer science
102	The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number ? Michael Fellows1,2 and Frances Rosamond1 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:12:58 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Bidimensionality Dominating set Tree decomposition Path decomposition Feedback vertex set Theoretical computer science Computational complexity theory Graph theory
103	Curriculum Vitae Personal Dates Name: Ken-ichi Kawarabayashi Add to Reading List Source URL: research.nii.ac.jp Language: English - Date: 2012-10-11 03:26:00 Graph Clique Combinatorics Cubic graph Chordal graph Tree decomposition Tree Planar graphs Víctor Neumann-Lara Graph theory Graph operations Minor
104	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Grid Proximity Graphs: LOGs, GIGs and GIRLs River Allen∗ Laurie Heyer† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:57 Tree Directed acyclic graph Planar graph Degree Path decomposition Graph coloring Graph theory Graph Vertex
105	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models Binay K. Bhattacharya∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-24 09:52:12 Binary trees Analysis of algorithms Computational complexity theory Time complexity Dynamic programming Interval graph Tree decomposition Rope Interval tree Graph theory Theoretical computer science Mathematics
106	Crossing-Number Critical Graphs have Bounded Path-width Petr Hlinˇ en´ y? School of Mathematical and Computing Sciences, Add to Reading List Source URL: www.fi.muni.cz Language: English - Date: 2005-02-11 15:58:00 Tree Graph property Induced path Minor Graph Planar graph End Mycielskian Line graph Graph theory Path decomposition Crossing number
107	The min-# problem, a hybrid error criterion for near-linear time performance Lilian Buzer∗† Abstract 2.1 Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:46 Network theory Shortest path problem NP-complete problems Connectivity Euclidean plane geometry Analysis of algorithms Path decomposition Minimum spanning tree Theoretical computer science Computational complexity theory Mathematics
108	ELSEVIER Information Processing Letters Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:07:31 Tree decomposition Robertson–Seymour theorem Minor Chordal graph Tree Graph Planar graphs Degeneracy Clique-sum Graph theory Path decomposition Graph operations
109	MCCD: Multi-Core Collision Detection between Deformable Models using Front-Based Decomposition Min Tang1 , Dinesh Manocha2 , Ruofeng Tong1 http://www.cs.unc.edu/∼geom/PCD/ 1 Department 2 Department Add to Reading List Source URL: gamma.cs.unc.edu Language: English - Date: 2009-07-06 03:15:21 Video game development Computing Applied mathematics Computational physics Bounding volume hierarchy Collision detection Tree traversal Algorithm Parallel computing 3D computer graphics Theoretical computer science Mathematics
110	Tackling the Partner Units Configuration Problem∗ Markus Aschinger, Conrad Drescher, Georg Gottlob, Peter Jeavons, Evgenij Thorstensen Computing Laboratory University of Oxford Add to Reading List Source URL: www.cs.ox.ac.uk Language: English - Date: 2013-06-06 21:34:43 Graph operations Tree decomposition Connectivity Path decomposition Decomposition method Nondeterministic algorithm Connected component Tree Graph theory Theoretical computer science Mathematics

UPDATE